github.com/andybalholm/brotli.bitReader.byte_pos (field)

23 uses

	github.com/andybalholm/brotli (current package)
		bit_reader.go#L60: 	byte_pos  uint
		bit_reader.go#L83: 	to.byte_pos = from.byte_pos
		bit_reader.go#L91: 	to.byte_pos = from.byte_pos
		bit_reader.go#L101: 	return uint(uint32(br.input_len-br.byte_pos) + (getAvailableBits(br) >> 3))
		bit_reader.go#L107: 	return br.input_len-br.byte_pos >= num
		bit_reader.go#L118: 		br.val_ |= (uint64(binary.LittleEndian.Uint32(br.input[br.byte_pos:]))) << 32
		bit_reader.go#L119: 		br.byte_pos += 4
		bit_reader.go#L132: 	if br.byte_pos == br.input_len {
		bit_reader.go#L137: 	br.val_ |= (uint64(br.input[br.byte_pos])) << 56
		bit_reader.go#L139: 	br.byte_pos++
		bit_reader.go#L184: 	br.byte_pos -= uint(unused_bytes)
		bit_reader.go#L246: 	copy(dest, br.input[br.byte_pos:][:num])
		bit_reader.go#L247: 	br.byte_pos += num
		decode.go#L2044: 		br.byte_pos = 0
		decode.go#L2052: 		br.byte_pos = 0
		decode.go#L2071: 					if br.byte_pos == br.input_len {
		decode.go#L2082: 						br.byte_pos = 0
		decode.go#L2104: 					*next_in = br.input[br.byte_pos:]
		decode.go#L2106: 					*available_in = br.input_len - br.byte_pos
		decode.go#L2131: 				*available_in = br.input_len - br.byte_pos
		decode.go#L2132: 				*next_in = br.input[br.byte_pos:]
		decode.go#L2483: 				*available_in = br.input_len - br.byte_pos
		decode.go#L2484: 				*next_in = br.input[br.byte_pos:]